Automated Deduction and Formal Methods
نویسنده
چکیده
The automated deduction and model checking communities have developed techniques that are impressively e ective when applied to suitable problems. However, these problems seldom coincide exactly with those that arise in formal methods. Using small but realistic examples for illustration, I will argue that e ective deductive support for formal methods requires cooperation among di erent techniques and an integrated approach to language, deduction, and supporting capabilities such as simulation and the construction of invariants and abstractions. Successful application of automated deduction to formal methods will enrich both elds, providing new opportunities for research and use of automated deduction, and making formal methods a truly useful and practical tool.
منابع مشابه
On Automating the Calculus of Relations
Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics and have found numerous applications in computing. We prove more than hundred theorems of relation algebras with off-the-shelf automated theorem provers. They form a basic calculus from which more advanced applications can be explored. We also present two autom...
متن کاملAutomated Deduction and its Application to Mathematics (11w2170)
The goal of researchers in automated deduction is to develop methods and tools to assist mathematicians, scientists, and engineers with some of the deductive aspects of their work. In contrast to other symbolic computation systems, the core methods in automated deduction focus on searching for proofs and counterexamples. Automated deduction can be applied to wide-ranging problems in nearly any ...
متن کاملMechanizing Formal Methods: Opportunities and Challenges
Mechanization makes it feasible to calculate properties of formally speciied systems. This ability creates new opportunities for using formal methods as an exploratory tool in system design. Achieving enough eeciency to make this practical raises challenging problems in automated deduction. These challenges can be met only by approaches that integrate consideration of its mechanization into the...
متن کاملRecovering Intuition from Automated Formal Proofs using Tableaux with Superdeduction
We propose an automated deduction method which allows us to produce proofs close to the human intuition and practice. This method is based on tableaux, which generate more natural proofs than similar methods relying on clausal forms, and uses the principles of superdeduction, among which the theory is used to enrich the deduction system with new deduction rules. We present two implementations o...
متن کاملProof Automation in Kleene Algebra
It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it has been demonstrated that off-the-shelf automated proof and counterexample search is an interesting alternative if combined with the right domain model. Furthermore it has been shown that variants of Kleene algebra might provi...
متن کامل